Description: % MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) % Finds a (near) optimal solution to a variation of the M-TSP by setting % up a GA to search for the shortest route (least distance needed for % each salesman to travel from the start location to individual cities % and back to the original starting place) Platform: |
Size: 4058 |
Author:5501018333@qq.com |
Hits:
Description: 遗传算法GA
遗传算法：
旅行商问题(traveling saleman problem,简称tsp)：
已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短-GA GA GA: TSP (traveling saleman problem, short tsp): n known distance between cities, a salesman of existing cities to be visited all the n, and can only visit each city once Finally, it must return to the starting city. How to arrange his visit to the order of these cities can make the total length of the shortest travel route Platform: |
Size: 4096 |
Author:王晨 |
Hits:
Description: 多旅行商问题的遗传算法 环形 固定节点- MTSPOFS_GA Fixed Start Open Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the "open" M-TSP by
setting up a GA to search for the shortest route (least distance needed
for each salesman to travel from the start location to unique individual
cities without returning to the starting location)
Platform: |
Size: 10240 |
Author:pxl |
Hits:
Description: 本程序是对经典的旅行商问题的一种解法,是学习数据结构算法的极佳材料,c语言编写,(This procedure is a solution to the classical traveling salesman problem, excellent material is data structure learning algorithm, c language,) Platform: |
Size: 15360 |
Author:txpspcu
|
Hits:
Description: 使用ga算法，通过八种评价机制解决多旅行商问题(The GA algorithm is used to solve the multiple traveling salesman problem via eight evaluation mechanisms) Platform: |
Size: 4096 |
Author:jyw
|
Hits:
Description: 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case of the vehicle routing scheduling Problem (VRP), due to the mathematician has proved the TSP Problem is NP Problem, therefore, the VRP also belongs to the NP problems.Traveling salesman problem (TSP) is translated into traveling salesman problem, traveling salesman problem, referred to as the TSP problem, is the most basic route problem, the problem is looking for single travelers from the starting point, through all of the requirements of a given point, after the final path back to the origin of the minimum cost) Platform: |
Size: 1024 |
Author:枫雪@SPW
|
Hits:
Description: 求解单旅行商问题的智能算法，蚁群算法。
输入城市间赋权向量（城市间路程），即可输出经过所有城市且总路程最短的最小哈密顿环。(telligent algorithm for solving single traveling salesman problem, ant colony algorithm.
By inputting the weight vector between cities (the distance between cities), the minimum Hamiltonian ring of all cities and the shortest total distance can be output.) Platform: |
Size: 9216 |
Author:王文轩
|
Hits:
Description: 用粒子群解多旅行商问题的初版，问题是现在求解的结果并不是最优，不知道问题出在哪里(The first edition of solving traveling salesman problem using particle swarm optimization, solving the problem is now the result is not optimal, don't know where is the problem) Platform: |
Size: 9216 |
Author:v大河小溪
|
Hits:
Description: 用遗传算法解决带有时间约束软时间窗口的VRP（旅行商）旅行商问题(Solving the VRP (traveling salesman) traveling salesman problem with time constrained soft time windows by genetic algorith) Platform: |
Size: 1024 |
Author:异域欢歌
|
Hits:
Description: 旅行商问题，以10个、30个城市为例，文件为TSP代码。(Traveling salesman problem, take 10, 30 cities for example, the document is TSP code.) Platform: |
Size: 1024 |
Author:学海无涯m |
Hits:
Description: TSP(旅行商)问题的测试数据及最优解，用于测试算法的优劣及效率等(The test data and optimal solution of the TSP (traveling salesman) problem are used to test the advantages and disadvantages of the algorithm and its efficiency, etc.) Platform: |
Size: 2024448 |
Author:molybdenum |
Hits:
Description: 用遗传算法实现旅行商问题，可选择城市数量(Traveling salesman problem is realized by genetic algorithm, and the number of cities can be selected.) Platform: |
Size: 3072 |
Author:tianyunong |
Hits:
Description: TSP问题
假设有一个旅行商人要拜访全国 31个省会城市，他需要选 择要走的路径，每个城市只能拜访一次
所选路径为最小值(TSP problem
Suppose a traveling salesman wants to visit 31 provincial capitals of the whole country. He needs to choose the way to go. Every city can only visit once.
The selected path is the minimum) Platform: |
Size: 1024 |
Author:X小白兔er |
Hits:
Description: 5 kinds of genetic algorithms to solve multiple traveling salesman problem (mtsp) matlab program 5, respectively, the following situations: 1. Back to the starting point a different starting point (TSP fixed amount) 2. Back to the starting point a different starting point (TSP amount calculated variable) 3. Starting the same starting point back to the beginning 4. Starting the same starting point to the starting point is not 5. Starting the same starting point back to the same end point (with different starting points) Platform: |
Size: 1433600 |
Author:zhangsanz |
Hits:
Description: tsp的java源码实现旅行商问题，即TSP问题（Traveling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(The Java source of TSP is one of the famous problems in the field of mathematics, that is, the TSP problem (Traveling Salesman Problem), which is also translated as travel salesman problem and cargo carrier problem. Suppose a traveler wants to visit a n city. He has to choose the way he wants to go. The limit of the path is that each city can visit only once, and finally it will return to the original city. The goal of path selection is to obtain the minimum path of all paths.) Platform: |
Size: 1024 |
Author:tomorrow1 |
Hits:
Description: matlab是一种编程软件，也称矩阵实验室. 在数值计算方面做出了很大的贡献. 多目标优化问题是最优化领域中的一种优化方法，得出的解是折衷解. 多目标优化问题可以分为约束多目标优化问题和无约束多目标优化.在实际生活中，有很多问题都可以被视为多目标优化问题，如旅行商问题、工程问题，证券投资问题等，然而采用matlab编程软件具有很好的求解展示效果.(Matlab is a programming software, also known as a matrix laboratory. It has made great contributions in numerical calculations. Multi-objective optimization problems are an optimization method in the field of optimization, and the solutions obtained are compromise solutions. Optimization problems can be divided into constrained multi-objective optimization problems and unconstrained multi-objective optimization problems. In real life, many problems can be considered as multi-objective optimization problems, such as traveling salesman problem, engineering problem, securities investment problem, etc. The matlab programming software has a good solution display effect.) Platform: |
Size: 250880 |
Author:hjing |
Hits:
Search - the traveling salesman